Comparison of Df-pn based Search Algorithms on Shogi Brinkmate Problems

نویسنده

  • Shunsuke SOEDA
چکیده

The currently best method is the one by Nagai, using df-pn+ to solve brinkmate problems. We have proposed a new threat based and proof number based algorithm called df-pn driven λ-search. We have conducted some preliminary experiments, showing that df-pn driven λ-search seems to be better than Nagai’s method in solving Shogi brinkmate problems. Although more invesigation is requiered, df-pn λ-search seem to be able to: • Solve brinkmate problems better than Nagai’s method. • Work much better with mixed problems of brinkmate positions and checkmate positions than Nagai’s method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search

Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domains with repetitions. Df-pn(r) cures it by ignoring proof and disproof numbers that may lead to infinite loops. This paper points out that df-pn(r) has a serious issue of underestimating proof and disproof numbers, while...

متن کامل

THE PERFORMANCE OF PN*, PDS, AND PN SEARCH ON 6x6 OTHELLO AND TSUME-SHOGI

After PN search was developed and had achieved many successes for solving some hard problems, innovations to depth-first search algorithms were based on the idea of proof numbers. This article introduces two such innovative algorithms: PN* and PDS. The PN* algorithm was developed for solving Tsume-Shogi problems, among which one with more than 1500 steps. Then, PDS was proposed to strengthen th...

متن کامل

Dual Lambda Search and Shogi Endgames

We propose a new threat-base search algorithm which takes into account threats by both players. In full-board Semeais in Go or Shogi endgames, making naive attack moves often result in losing the game. The reason is that a player must first make a defense move if the opponent has a better attack move than his own. Some attack moves weaken the defense of the player who made the move. Thus, playe...

متن کامل

Parallel Depth First Proof Number Search

The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simple but effective parallelization of the df-pn search algorithm for a shared-memory system. In this parallelization, multiple agents autonomously conduct the df-pn with a shared transposition table. For effective coopera...

متن کامل

The PN*-search algorithm: Application to tsume-shogi

This paper proposes a new search algorithm, denoted PN∗, for AND/OR tree search. The algorithm is based on proof-number (PN) search, a best-first search algorithm, proposed by Allis et al. [Artificial Intelligence 66 (1) (1994) 91–124], and on Korf’s RBFS algorithm [Artificial Intelligence 62 (1) (1993) 41–78]. PN∗ combines several existing ideas. It transforms a best-first PN-search algorithm ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006